A Universal Bound for the Average Cost of Root Finding
نویسنده
چکیده
We analyze a path-lifting algorithm for finding an approximate zero of a complex polynomial, and show that for any polynomial with distinct roots in the unit disk, the average number of iterates this algorithm requires is universally bounded by a constant times the log of the condition number. In particular, this bound is independent of the degree d of the polynomial. The average is taken over initial values z with |z| = 1+1/d using uniform measure. Stony Brook IMS Preprint #2009/1 March 2009 CONTENTS
منابع مشابه
A Universal Newborn Hearing Screening in Iran
Objectives: In September 2002 University of Social Welfare & Rehabilitation Sciences established a pilot universal newborn hearing screening program in two crowded maternity hospital in Tehran. Our objective was to assess the feasibility of implementing universal newborn hearing screening in IRAN. Methods: Between September 2002 and March 2004 a total of 7718 newborns were screened for heari...
متن کاملFinding the Minimum Distance from the National Electricity Grid for the Cost-Effective Use of Diesel Generator-Based Hybrid Renewable Systems in Iran
The electricity economy and its excessive consumption have become one of the main concerns of the Iranian government for many years. This issue, along with recent droughts, shows the need to use renewable energy that is free and clean and does not require water. In addition, due to the high cost of cable-laying and maintenance of power lines, it is not at all an option at all distances over the...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملCost-aware Topology Customization of Mesh-based Networks-on-Chip
Nowadays, the growing demand for supporting multiple applications causes to use multiple IPs onto the chip. In fact, finding truly scalable communication architecture will be a critical concern. To this end, the Networks-on-Chip (NoC) paradigm has emerged as a promising solution to on-chip communication challenges within the silicon-based electronics. Many of today’s NoC architectures are based...
متن کاملبهینه سازی هزینه کل تولید و زمان در سلول رباتیک سه ماشین
In this research, robotic cell scheduling problem with three CNC machines and with an operation on each machine with the purpose of optimizing manufacturing cost and time in S1 cycle has been investigated. To obtain the optimal total cost of production has been used the optimal processing time on machine operation. In this research, robotic cell scheduling is studied in three different situatio...
متن کامل